Finite termination of a dual Newton method for convex best C 1 interpolation and smoothing
نویسندگان
چکیده
منابع مشابه
Quadratic Convergence of Newton’s Method for Convex Interpolation and Smoothing
In this paper, we prove that Newton’s method for convex best interpolation is locally q-quadratically convergent, giving an answer to a question of Irvine, Marine and Smith [7] and strengthening a result of Andersson and Elfving [1] and our previous work [5]. A damped Newton-type method is presented which has global q-quadratic convergence. Analogous results are obtained for the convex smoothin...
متن کاملArmijo Newton method for convex best interpolation
More than a decade agao, Newton’s method has been proposed for constructing the convex best interpolant. Its local quadratic convergence has only been established recently by recasting it as the generalized Newton method for semismooth equations. It still remains mysterious that the Newton method coupled with line search strategies works practically well in global sense. Similar to the classica...
متن کاملRegularity and well-posedness of a dual program for convex best C1-spline interpolation
It has been known that an efficient approach to the determination of the convex best C-spline interpolant to a set of given data is to solve its unconstrained dual program by standard numerical methods (e.g., Newton’s method.) Regularity and well-posedness of the dual program, which are two important issues but not well-addressed in the literature, are focus of the paper. Our well-posedness res...
متن کاملA Finite Newton Method for Classification Problems
A fundamental classification problem of data mining and machine learning is that of minimizing a strongly convex, piecewise quadratic function on the n-dimensional real space Rn. We show finite termination of a Newton method to the unique global solution starting from any point in Rn. If the function is well conditioned, then no stepsize is required from the start, and if not, an Armijo stepsiz...
متن کاملA Smoothing Technique for the Minimum Norm Solution of Absolute Value Equation
One of the issues that has been considered by the researchers in terms of theory and practice is the problem of finding minimum norm solution. In fact, in general, absolute value equation may have infinitely many solutions. In such cases, the best and most natural choice is the solution with the minimum norm. In this paper, the minimum norm-1 solution of absolute value equation is investigated. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 96 شماره
صفحات -
تاریخ انتشار 2003